Efficient Parallel Implementation of Transitive Closure of Digraphs
نویسندگان
چکیده
منابع مشابه
An Efficient Transitive Closure Algorithm for Cyclic Digraphs
We present a new transitive closure algorithm that is based on strong component detection. The new algorithm is more eecient than the previous transitive closure algorithms that are based on strong components detection, since it does not generate unnecessary partial successor sets and scans the input graph only once.
متن کاملEfficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors
We propose a simple data structure for an efficient implementation of the Italiano algorithms for the dynamic updating of the transitive closure of a directed graph represented as adjacency matrix on a model of associative (or content addressable) parallel processors with vertical processing (the STAR–machine). Associative versions of the Italiano algorithms are represented as procedures Delete...
متن کاملTurán theorems and convexity invariants for directed graphs
This paper is motivated by the desire to evaluate certain classical convexity invariants (specifically, the Helly and Radon numbers) in the context of transitive closure of arcs in the complete digraph. To do so, it is necessary to establish several new Turán type results for digraphs and characterize the associated extremal digraphs. In the case of the Radon number, we establish the following ...
متن کاملOn the PVM Computations of Transitive Closure and Algebraic Path Problems
We investigate experimentally, alternative approaches to the distributed parallel computation of a class of problems related to the generic transitive closure problem and the algebraic path problem. Our main result is the comparison of two parallel algorithms for transitive closure, { a straightforward coarse-grained parallel implementation of the Warshall algorithm named Block-Processing (whic...
متن کاملq-Series Arising From The Study of Random Graphs
This paper deals with q{series arising from the study of the transitiveclosure problem in random acyclic digraphs. In particularit presents an identity involvingdivisor generatingfunctions which allows to determine the asymptotic behavior of polynomials deened by a general class of recursive equations, including the polynomials for the mean and the variance of the size of the transitive closure...
متن کامل